An Algorithm for Quasi-Associative and Quasi-Markovian Rules of Combination in Information Fusion
نویسندگان
چکیده
منابع مشابه
An Algorithm for Quasi-Associative and Quasi-Markovian Rules of Combination in Information Fusion
In this paper one proposes a simple algorithm of combining the fusion rules, those rules which first use the conjunctive rule and then the transfer of conflicting mass to the non-empty sets, in such a way that they gain the property of associativity and fulfill the Markovian requirement for dynamic fusion. Also, a new fusion rule, SDL-improved, is presented.
متن کاملdevelopment and implementation of an optimized control strategy for induction machine in an electric vehicle
in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...
15 صفحه اولQuasi Markovian behavior in mixing maps
We consider the time dependent probability distribution of a coarse grained observable Y whose evolution is governed by a discrete time map. If the map is mixing, the time dependent one-step transition probabilities converge in the long time limit to yield an ergodic stochastic matrix. The stationary distribution of this matrix is identical to the asymptotic distribution of Y under the exact dy...
متن کاملAn algorithm for detecting Directional Quasi–Convexity
Directional Quasi–Convexity (DQC) is a sufficient condition for Nekhoroshev stability, that is, stability for finite but very long times, of elliptic equilibria of Hamiltonian systems. The numerical detection of DQC is elementary for system with three degrees of freedom. In this article, we propose a recursive algorithm to test DQC in any number n ≥ 4 of degrees of freedom.
متن کاملApplying Quasi-Separability to Markovian Process Algebra
Stochastic process algebras have become an accepted part of performance modelling over recent years. Because of the advantages of compositionality and exibility they are increasingly being used to model larger and more complex systems. Therefore tools which support the evaluation of models expressed using stochastic process algebra must be able to utilise the full range of decomposition and sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2016
ISSN: 1556-5068
DOI: 10.2139/ssrn.2725507